A domain containing all zeros of the partial theta function
نویسندگان
چکیده
منابع مشابه
On annuli containing all the zeros of a polynomial
In this paper, we obtain the annuli that contain all the zeros of the polynomial p(z) = a 0 + a 1 z + a 2 z 2 + · · · + a n z n , where a i 's are complex coefficients and z is a complex variable. Our results sharpen some of the recently obtained results in this direction. Also, we develop a MATLAB code to show that for some polynomials the bounds obtained by our results are considerably sharpe...
متن کاملAnnulus containing all the zeros of a polynomial
Recently Dalal and Govil [5] proved that, for any set of positive numbers {Ak}k=1 such that ∑n k=1 Ak = 1, a complex polynomial P (z) = ∑n k=0 dkz k (dk = 0, 0 ≤ k ≤ n) has all its zeros in the annulus A = {z : r1 ≤ |z| ≤ r2}, where r1 = min 1≤k≤n { Ak ∣∣∣d0 dk ∣∣∣ } 1 k and r2 = max 1≤k≤n { 1 Ak ∣∣∣dn−k dn ∣∣∣ } 1 k . This paper presents the best possible results in the same direction by ident...
متن کاملZeros of Partial Sums of the Riemann Zeta-function
We write ρX = βX + iγX for a typical zero of FX(s). The number of these up to height T we denote by NX(T ), and the number of these with βX ≥ σ by NX(σ, T ). We follow the convention that if T is the ordinate of a zero, then NX(T ), say, is defined as limǫ→0+ NX(T + ǫ). There are two natural ways to pose questions about NX(T ), NX(σ, T ), and the distribution of the zeros generally. We can fix ...
متن کاملA Sublinear Bound on the Chromatic Zeros of Theta Graphs
Let = (m 1 ; : : : ; m k) denote a graph consisting of two vertices u; v and k internally-disjoint uv-paths of lengths m 1 , : : : ,m k. We exhibit an implicitly-deened function R(k) such that every complex zero z of the chromatic polynomial of satisses jz ? 1j < R(k), and show that R(k) is sublinear as k ! 1.
متن کاملOn The Annular Regions Containing All The Zeros Of A Polynomial∗
In this paper, we obtain some results concerning the location of zeros of a complex polynomial. The results presented here improve upon the earlier results and this is justified through some specific examples, for which we develop MATLAB code to construct polynomials for which the region obtained by our results are sharper than obtainable from some of the known results. A brief comparative anal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Publicationes Mathematicae Debrecen
سال: 2018
ISSN: 0033-3883
DOI: 10.5486/pmd.2018.8156